| 翻訳と辞書 |
| Ketan Mulmuley ： ウィキペディア英語版 |
Ketan Mulmuley
Ketan Mulmuley is a professor in the Department of Computer Science at the University of Chicago, and a sometime visiting professor at IIT Bombay.〔 He specializes in theoretical computer science, especially computational complexity theory, and in recent years has been working on "geometric complexity theory", an approach to the P versus NP problem through the techniques of algebraic geometry, with Milind Sohoni of IIT Bombay.〔Lance Fortnow, "(Status of the P vs NP Problem )", CACM, September 2009〕 He is also known for his result with Umesh Vazirani and Vijay Vazirani that showed that "Matching is as easy as matrix inversion",〔 STOC version: 〕 in a paper that introduced the isolation lemma.〔(The Isolation Lemma and Beyond ), by Richard J. Lipton〕
He earned his PhD in computer science from Carnegie Mellon University〔(Page at IIT Bombay (visiting professor) )〕 in 1985 under Dana Scott, winning the 1986 ACM Doctoral Dissertation Award for his thesis ''Full Abstraction and Semantic Equivalence''.〔(ACM Award citation )〕 He also won a Miller fellowship at the University of California, Berkeley for 1985–1987, and a Guggenheim Foundation Fellowship for the year 1999–2000.〔
==Books==
*
*
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Ketan Mulmuley」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|